Smoothness of Minkowski sum and generic rotations
نویسندگان
چکیده
منابع مشابه
Minkowski Sum Selection and Finding
Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ R, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p+ q)|p ∈ P, q ∈ Q,A(p+ q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection problem is to find the k largest objective value among all objective ...
متن کاملMinkowski Sum of Polytopes and Its Normality
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.
متن کاملTwo Approximate Minkowski Sum Algorithms
We present two approximate Minkowski sum algorithms for planar regions bounded by line and circle segments. Both algorithms form a convolution curve, construct its arrangement, and use winding numbers to identify sum cells. The first uses the kinetic convolution and the second uses our monotonic convolution. The asymptotic running times of the exact algorithms are increased by km logm with m th...
متن کاملConstrained Minkowski Sum Selection and Finding
Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ Rλ×2, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p + q)|p ∈ P, q ∈ Q,A(p + q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection Problem is to find the k largest objective value among all objec...
متن کاملMinkowski sum boundary surfaces of 3D-objects
Given two solids A and B with piecewise smooth boundary we discuss the computation of the boundary Γ of the Minkowski sum A + B. This boundary surface Γ is part of the envelope when B is moved by translations defined by vectors a ∈ A, or vice versa. We present an efficient algorithm working for dense point clouds or for triangular meshes. Besides this, the global self intersections of the bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2017
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2017.01.088